A Breadth-First Course in Multicore and Manycore Programming Suzanne Rivoire Sonoma State University Department of Computer Science

Source URL: rivoire.cs.sonoma.edu

• Concurrent computing
• Parallel computing
• Computing
• Computer programming
• Manycore processor
• Data parallelism
• General-purpose computing on graphics processing units
• Parallel programming model
• Multi-core processor
• Thread
• CUDA
• OpenMP

SIGCSE 2011 Poster Proposal: Universal Design for Learning in CS1 Suzanne Rivoire Department of Computer Science Sonoma State University, Rohnert Park, CA, USA

Source URL: rivoire.cs.sonoma.edu

• Education
• Learning
• Human behavior
• Pedagogy
• Segregation
• Educational psychology
• Higher education
• Universal Design for Learning
• Philosophy of education
• Educational technology
• Inclusion
• Accessibility

Expected Reachability-Time Games Vojtˇech Forejta , Marta Kwiatkowskaa , Gethin Normanb , Ashutosh Trivedic a Department of Computer Science, University of Oxford, UK. of Computing Science, University of Glasgow, UK.

Source URL: qav.comlab.ox.ac.uk

Pushing to the Top with K-induction Arie Gurfinkel Electrical and Computer Engineering University of Waterloo joint work with Alexander Ivrii (IBM)

Source URL: arieg.bitbucket.io

Automated Verification Techniques for Probabilistic Systems Vojtˇech Forejt1 , Marta Kwiatkowska1 , Gethin Norman2 , and David Parker1 1 Department of Computer Science, University of Oxford, Oxford, OX1 3QD, UK

Source URL: qav.comlab.ox.ac.uk

• Markov models
• Probability
• Dynamic programming
• Markov processes
• Stochastic control
• Markov decision process
• Markov chain
• Linear temporal logic
• S2
• Reinforcement learning
• S0

Revisiting Question Answering in Vampire Giles Reger School of Computer Science, University of Manchester, UK The 4th Vampire Workshop

Source URL: www.cs.man.ac.uk

• Automated theorem proving
• Resolution
• IP
• X0
• Vampire
• Mathematics
• Propositional calculus
• Logic

On Stochastic Games with Multiple Objectives Taolue Chen, Vojtˇech Forejt, Marta Kwiatkowska, Aistis Simaitis, and Clemens Wiltsche Department of Computer Science, University of Oxford, United Kingdom Abstract. We stud

Source URL: qav.comlab.ox.ac.uk

• Mathematical analysis
• Measure theory
• Mathematics
• Probability and statistics
• Determinacy
• Stochastic game
• Strategy
• Markov chain
• Stochastic process
• Support
• Mathematical optimization
• Statistical model

Softstar: Heuristic-Guided Probabilistic Inference Mathew Monfort Computer Science Department University of Illinois at Chicago Chicago, IL 60607

Source URL: cims.nyu.edu

• Search algorithms
• Routing algorithms
• Combinatorial optimization
• Mathematics
• Information science
• Information retrieval
• Game artificial intelligence
• A* search algorithm
• Heuristic
• Bayesian network
• Dijkstra's algorithm
• Algorithm

Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece

Source URL: www.cs.man.ac.uk

• Mathematical logic
• Theoretical computer science
• Mathematics
• Quantification
• Logic in computer science
• Formal methods
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Universal quantification
• True quantified Boolean formula

Structural Properties in δ-Hyperbolic Networks: Algorithmic Analysis and Implications Hend Alrasheed Kent State University, Department of Computer Science Kent Ohio, USA

Source URL: gdac.uqam.ca

• Graph theory
• Network theory
• Bipartite graphs
• Graph operations
• Centrality
• Network analysis
• Distance
• Graph
• Connectivity
• Tree
• Shortest path problem
• Degeneracy